Critical groups of graphs with dihedral actions

نویسندگان

  • Darren B. Glass
  • Criel Merino
چکیده

In this paper we consider the critical group of finite connected graphs which admit harmonic actions by the dihedral group Dn. In particular, we show that if the orbits of the Dn-action all have either n or 2n points then the critical group of such a graph can be decomposed in terms of the critical groups of the quotients of the graph by certain subgroups of the automorphism group. This is analogous to a theorem of Kani and Rosen which decomposes the Jacobians of algebraic curves with a Dn-action. © 2014 Elsevier Ltd. All rights reserved.

منابع مشابه

On the eigenvalues of Cayley graphs on generalized dihedral groups

‎Let $Gamma$ be a graph with adjacency eigenvalues $lambda_1leqlambda_2leqldotsleqlambda_n$‎. ‎Then the energy of‎ ‎$Gamma$‎, ‎a concept defined in 1978 by Gutman‎, ‎is defined as $mathcal{E}(G)=sum_{i=1}^n|lambda_i|$‎. ‎Also‎ ‎the Estrada index of $Gamma$‎, ‎which is defined in 2000 by Ernesto Estrada‎, ‎is defined as $EE(Gamma)=sum_{i=1}^ne^{lambda_i}$‎. ‎In this paper‎, ‎we compute the eigen...

متن کامل

Critical groups of graphs with dihedral actions II

In this paper we consider the critical group of finite connected graphs which admit harmonic actions by the dihedral group Dn, extending earlier work by the author and Criel Merino. In particular, we show that the critical group of such a graph can be decomposed in terms of the critical groups of the quotients of the graph by certain subgroups of the automorphism group. This is analogous to a t...

متن کامل

On two-dimensional Cayley graphs

A subset W of the vertices of a graph G is a resolving set for G when for each pair of distinct vertices u,v in V (G) there exists w in W such that d(u,w)≠d(v,w). The cardinality of a minimum resolving set for G is the metric dimension of G. This concept has applications in many diverse areas including network discovery, robot navigation, image processing, combinatorial search and optimization....

متن کامل

On dihedrants admitting arc-regular group actions

We consider Cayley graphs Γ over dihedral groups, dihedrants for short, which admit an automorphism group G acting regularly on the arc set of Γ . We prove that, if D2n ≤G≤ Aut(Γ ) is a regular dihedral subgroup of G of order 2n such that any of its index 2 cyclic subgroups is core-free in G, then Γ belongs to the family of graphs of the form (Kn1 ⊗ · · · ⊗Kn )[Kc m], where 2n= n1 · · ·n m, and...

متن کامل

Infinitely many one-regular Cayley graphs on dihedral groups of any prescribed valency

A graph is one-regular if its automorphism group acts regularly on the arc set. In this paper, we construct a new infinite family of one-regular Cayley graphs of any prescribed valency. In fact, for any two positive integers , k 2 except for ( , k) ∈ {(2,3), (2,4)}, the Cayley graph Cay(Dn,S) on dihedral groups Dn = 〈a, b | an = b2 = (ab)2 = 1〉 with S = {a1+ +···+ t b | 0 t k − 1} and n = ∑k−1 ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

متن کامل
عنوان ژورنال:
  • Eur. J. Comb.

دوره 39  شماره 

صفحات  -

تاریخ انتشار 2014